Isometric Universal Graphs

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in coincide with corresponding $G$. We show that for any integer $n\ge 1$, there on $3^{n+O(\log^2 n)}$ contains copies all $n$-vertex graphs. Our main tool new type distance labelling scheme, whose study might be independent interest.